This paper presents an efficient algorithm for polygon clipping which processes general polygons
2.
Polygon clipping is more often used than line clipping in practice , so it is the main subject in clipping research now
3.
This paper puts forward an efficient algorithm for polygon clipping , and it is suitable for not only concave polygon but also the polygon with hole in it
4.
In addition , it suits for the case in which polygon clipping turns out a lot of discrete consequential polygons , so this algorithm is general to all kinds of polygon
5.
During practical research , comparing with line clipping , polygon clipping has high rate of utilization , so it is the main subjects of clipping studied at present
6.
At one time the second encoding technology is developed from retangle window to circle window , from line clipping to polygon clipping and from 2 - d clipping to 3 - d clipping
7.
This paper researches the basic algorithms of computer graphics including the algorithms of an efficient algorithm for polygon clipping and pixel - level algorithm for generating archimedes and ivolute curve
8.
The discrete optimization of boundary curve and the optimization of polygon clipping are discussed on the basis of the above research , this surface automatic mesh generation have applied to cae software successfully which can create high quality element . the method is steady and reliable . the speeding of the meshing is good
9.
By constructing the list of vertices of polygon and intersecting points between polygon and rectangle , the list of vertices of rectangle and between polygon and rectangle , the list of incoming points and the list of outcoming points , the problem that how to confirm close clipped area edge is solved . at the same time , the second encoding technology is developed from line clipping to polygon clipping so that the speed of algorithm is increased
मोबाइल